Data-Structures-and-Algorithms/Java/Leetcode/1614. Maximum Nesting Depth of the Parentheses at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Java/Leetcode/1614. Maximum Nesting Depth of the Parentheses at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.4 (5019 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
class Solution {
 public int maxDepth(String s) {
 Stack<Character> st=new Stack<>();
 int count=0;
 for(int i=0;i<s.length();i++){
 if(s.charAt(i)=='('){
 st.push(s.charAt(i));
 }
 else{
 if(count<st.size())
 count=st.size();

 else if(s.charAt(i)==')'){
 st.pop();
 }

 }

 }
 return count;
 }
}